Clustering Regulatory Signals by Binary Trees
نویسندگان
چکیده
Application of the phylogenetic footprinting techniques to bacterial genomes generates a large number of potential regulatory sites identified upstream of orthologous genes. The next step of such analysis should be clustering of sites corresponding to one signal, that is, binding sites of one regulator. We describe an algorithm for clustering of regulatory sites and present the results of its testing on real data.
منابع مشابه
Bayesian Rose Trees
Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable hierarchies to those with binary branching structure. This limitation, while computationally convenient, is often undesirable. In this paper we explore a Bay...
متن کاملComparison of MLP NN Approach with PCA and ICA for Extraction of Hidden Regulatory Signals in Biological Networks
The biologists now face with the masses of high dimensional datasets generated from various high-throughput technologies, which are outputs of complex inter-connected biological networks at different levels driven by a number of hidden regulatory signals. So far, many computational and statistical methods such as PCA and ICA have been employed for computing low-dimensional or hidden represe...
متن کاملA New Clustering Algorithm for Can-order Policies in Joint Replenishment Problem
A novel clustering algorithm is proposed and applied to the multi-item replenishment processing. This new algorithm has two distinguished features: non-binary hierarchical tree and the feature of overlapping clustering. A non-binary hierarchical tree is much smaller than the binary-trees constructed by most traditional algorithms and, therefore, it clearly highlights meaningful clusters which s...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملClustering using Unsupervised Binary Trees: CUBT
We introduce a new clustering method based on unsupervised binary trees. It is a three stages procedure, which performs on a first stage recursive binary splits reducing the heterogeneity of the data within the new subsamples. On the second stage (pruning) adjacent nodes are considered to be aggregated. Finally, on the third stage (joining) similar clusters are joined even if they do not descen...
متن کامل